Duality for Geometric Set Cover and Geometric Hitting Set Problems on Pseudodisks
نویسندگان
چکیده
Given an instance of a geometric set cover problem on a set of points X and a set of objects R, the dual is a geometric hitting set problem on a set of points P and a set of objects Q, where there exists a one-to-one mapping from each xj ∈ X to a dual object Qj ∈ Q and for each Ri ∈ R to a dual point in pi ∈ P , so that a dual point pi is contained in a dual object Qj if and only if the corresponding primal point xj is covered by the object Ri. In this work, we explore the setting of geometric duality for geometric set cover problems on pseudodisks. We first show that there does not always exist a geometric dual on pseudodisks. We initiate the search for a characterization of the class of objects that may be dualized by identifying a sufficient (but not necessary) property for a dual to exist on distinct pseudodisks, called the pair-cover and crossing-quad free property. We show that such problems may be dualized into hitting set instances on pseudodisks by building a planar support for the dual instance, and then constructing an orthogonal drawing of the support which we transform into a dual set of pseudodisks. A corollary of these results is a PTAS for dualizable set cover problems using the PTAS for hitting set on pseudodisks.
منابع مشابه
Exact algorithms and APX-hardness results for geometric packing and covering problems
We study several geometric set cover and set packing problems involving configurations of points and geometric objects in Euclidean space. We show that it is APX-hard to compute a minimum cover of a set of points in the plane by a family of axis-aligned fat rectangles, even when each rectangle is an ǫ-perturbed copy of a single unit square. We extend this result to several other classes of obje...
متن کاملExact Algorithms and APX-Hardness Results for Geometric Set Cover
We study several geometric set cover problems in which the goal is to compute a minimum cover of a given set of points in Euclidean space by a family of geometric objects. We give a short proof that this problem is APX-hard when the objects are axis-aligned fat rectangles, even when each rectangle is an ǫ-perturbed copy of a single unit square. We extend this result to several other classes of ...
متن کاملQPTAS for Weighted Geometric Set Cover on Pseudodisks and Halfspaces
Weighted geometric set-cover problems arise naturally in several geometric and non-geometric settings (e.g. the breakthrough of Bansal and Pruhs (FOCS 2010) reduces a wide class of machine scheduling problems to weighted geometric set-cover). More than two decades of research has succeeded in settling the (1 + )-approximability status for most geometric set-cover problems, except for some basic...
متن کاملQPTAS for Geometric Set-Cover Problems via Optimal Separators
Weighted geometric set-cover problems arise naturally in several geometric and non-geometric set-tings (e.g. the breakthrough of Bansal-Pruhs (FOCS 2010) reduces a wide class of machine schedulingproblems to weighted geometric set-cover). More than two decades of research has succeeded in settlingthe (1+ )-approximability status for most geometric set-cover problems, except for ...
متن کاملGeometric Optimization Revisited
Many combinatorial optimization problems such as set cover, clustering, and graph matching have been formulated in geometric settings. We review the progress made in recent years on a number of such geometric optimization problems, with an emphasis on how geometry has been exploited to develop better algorithms. Instead of discussing many problems, we focus on a few problems, namely, set cover,...
متن کامل